A Saliency-Based Patch Sampling Approach for Deep Artistic Media Recognition
نویسندگان
چکیده
منابع مشابه
Artistic Painting Style Transformation Using a Patch-based Sampling Method
Painting style transformation aims to produce a painting in a particular artist’s style from a picture or other paintings. In the previous implementations of example-based painting style transfer, users had to manually select the patches from example patches. It is time-consuming and subjective for a user to select proper patches from a large number of patches. This paper develops a patch-based...
متن کاملAction recognition by saliency-based dense sampling
Action recognition, aiming to automatically classify actions from a series of observations, has attracted more attention in the computer vision community. The state-of-the-art action recognition methods utilize dense sampled trajectories to build feature representations. However, their performances are limited due to action region clutters and camera motions in real world applications. No matte...
متن کاملCompressed-Sampling-Based Image Saliency Detection in the Wavelet Domain
When watching natural scenes, an overwhelming amount of information is delivered to the Human Visual System (HVS). The optic nerve is estimated to receive around 108 bits of information a second. This large amount of information can’t be processed right away through our neural system. Visual attention mechanism enables HVS to spend neural resources efficiently, only on the selected parts of the...
متن کاملSaliency Based Framework for Facial Expression Recognition
This article proposes a novel framework for the recognition of six universal facial expressions. The framework is based on three set of features extracted from the face image: entropy, brightness and local binary pattern. First, saliency maps are obtained by state-of-the-art saliency detection algorithm i.e. “frequency-tuned salient region detection”. The idea is to use saliency maps to find ap...
متن کاملConstructive sampling for patch-based embedding
To process high-dimensional big data, we assume that sufficiently small patches (or neighborhoods) of the data are approximately linear. These patches represent the tangent spaces of an underlying manifold structure from which we assume the data is sampled. We use these tangent spaces to extend the scalar relations that are used by many kernel methods to matrix relations, which encompass multid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2021
ISSN: 2079-9292
DOI: 10.3390/electronics10091053